A survey of Solitaire Clobber
نویسندگان
چکیده
Solitaire Clobber is a one-player variant of the 2-player board game Clobber introduced by Albert et al. in 2002. According to simple rules, the objective of Solitaire Clobber is to capture the maximum number of stones from a given graph. Two versions of Solitaire Clobber were recently investigated: a partisan and an impartial one. In this survey, we give an overview of the major results about Solitaire Clobber, more especially about the impartial version. In particular, the game is considered on grids, trees, and hypercubes. Two new results are provided: when playing on a tree, we show that the minimum number of remaining stones can be computed in polynomial time. We also assert that any game position on a “large” grid can be reduced to 1 or 2 stones. Note that in each part of this survey, we propose several open problems related to Solitaire Clobber.
منابع مشابه
Solitaire Clobber
Clobber is a new two-player board game. In this paper, we introduce the 1-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and columns, we show that a checker...
متن کامل2 00 2 Solitaire Clobber
Clobber is a new two-player board game. In this paper, we introduce the oneplayer variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and two columns, we show that a ch...
متن کاملPlaying Clobber on a Cycle1
We present the combinatorial 2-player game clobber and its 1-player version solitaire clobber. We present some old and recent results on both games.
متن کاملSolitaire Clobber as an Optimization Problem on Words
We prove that the one-player game Solitaire Clobber 2 is equivalent to an optimization problem on a set of words defined by seven classes of forbidden patterns when played on the line or on the cycle. This enables us to show that this game is solvable in linear time. Using this word representation, we also prove that, playing on the cycle, it is always possible to remove at least 2n/3 pawns, an...
متن کاملSolitaire Clobber Played on Hamming Graphs
The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones. The game is interesting if there is at least one stone of e...
متن کامل